Combinatorial Generation of Planar Sets

We introduce a multi-dimensional generalization of the Euclidean algorithm and show how it is related to digital geometry particularly generation recognition planes. associate with steps geometrical extensions substitutions, i.e., rules that replace faces by unions faces, build finite sets called patterns. examine several their combinatorial, topological properties. This work first step toward incremental computation patterns locally fit surface for accurate approximation tangent